770A - New Password - CodeForces Solution


*special problem implementation *800

Please click on ads to support us..

Python Code:

from math import ceil
n, k = list(map(int, input().split()))
a = 'qwertyuiopasdfghjklzxcvbnm'
b = a[:k]*(ceil(n / k))
print(b[:n])

C++ Code:

#include <iostream>

using namespace std; 
int main() {
	int n, k;
	cin >> n >> k;
	char A[26] = { 'a', 'b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z' };
	string s = "";
	
	for (int i = 0; i < k; i++) {
		s = s + A[i];
	}
	int z = n - k;
	int x = k - 1;
	int a = rand()%k;
	a--;
	while (z > 0) {
		
		while (s[x] == A[a]) {
			if (a >= k-1)//
				a--;//
			else//
				a++;//
		}
		x++;
	
		s = s + A[a];
		z--;
	}

	cout << s << endl;
}
 


Comments

Submit
0 Comments
More Questions

1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles
1562B - Scenes From a Memory
1521A - Nastia and Nearly Good Numbers
208. Implement Trie
1605B - Reverse Sort
1607C - Minimum Extraction
1604B - XOR Specia-LIS-t
1606B - Update Files
1598B - Groups
1602B - Divine Array
1594B - Special Numbers
1614A - Divan and a Store
2085. Count Common Words With One Occurrence
2089. Find Target Indices After Sorting Array
2090. K Radius Subarray Averages
2091. Removing Minimum and Maximum From Array
6. Zigzag Conversion
1612B - Special Permutation
1481. Least Number of Unique Integers after K Removals
1035. Uncrossed Lines
328. Odd Even Linked List
1219. Path with Maximum Gold